Keg Master: a Graph-Aware Visual Editor for Scene Graphs
نویسنده
چکیده
This paper describes the manner in which papers should be formatted for papers adhering to the ACS series, Conference in Research and Practice in Information Technology. The abstract should be a maximum of 250 words and should clearly identify the content of the paper. The text in the abstract should be in style "abstract text". Note that the best way I have found to get the styles correct is to copy the text into a copy of this template rather than attempting to change the original file.
منابع مشابه
Keg Master: a Graph-Aware Visual Editor for 3D Graphs
This paper presents Keg Master, a graph-aware visual editor for 3D graphs. Keg Master is novel in that it works with a graph description language as opposed to a scene graph description language. Keg Master supports a range of 3D graph operations. Graphs may be stored to and retrieved from files. A range of objects may be added to a graph, cone, cube, sphere, and edge. Attributes may be specifi...
متن کاملWebKB-GE - A Visual Editor for Canonical Conceptual Graphs (Research Note)
This paper reports a CG editor implementation which uses canonical formation as the direct manipulation metaphore. The editor is written in Java and embedded within the WekKB indexation tool. The user's mental map is explicitly supported by a separate representation of a graph's visual layout. In addition, cooperative knowledge formulation is supported by network-aware work-sharing features. Th...
متن کاملGraph-based Visual Saliency Model using Background Color
Visual saliency is a cognitive psychology concept that makes some stimuli of a scene stand out relative to their neighbors and attract our attention. Computing visual saliency is a topic of recent interest. Here, we propose a graph-based method for saliency detection, which contains three stages: pre-processing, initial saliency detection and final saliency detection. The initial saliency map i...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملReconstruction of Polyhedron Objects by Structure Graphs Integration
Reconstruction of polyhedron objects by structure graph integration was described. We assumed a graph representation of 3D scene. Reconstructed objects are polyhedrons and the recognized scene is static. Structure graphs are constructed for each view point. The process of structure graph integration consist in searching matchings between the graph of the observed view and the graph of the recon...
متن کامل